Mapping an N N Image on P Processors
نویسندگان
چکیده
An cvaluation is made of hardware and software rcquircmcnts to support window-, crinkleand pyramid-mapping on a lincar and a squarc proccssor array. The diffcrcnt mapping stratcgics also lcad to diffcrcnt algorithms to solvc imagc proccssing problcms. Thrcc imagc proccssing problems servc as an cxarnplc of thc algorithmic diffcrcnccs causcd by the mapping mcthods. For thc invcstigatcd 2D proccssor array, thc pyramid mapping givcs thc fastcst rcsults.
منابع مشابه
Speeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملAn O(log n) pyramid hough transform
4h.,nas'c'I his paper describes a divide-and-conquer Hough transtornr technique for detecting a given number of straight edges or lines in an image, This technique is designed for implementation on a pyramid of processors, and requires only O(log a) computational steps for an image of size n x,t ords : pyramids, Hough transform, divide-and-conquer. The Hough transform is a technique for detecti...
متن کاملOptimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract)
Consider a set P of points in the plane sorted by x-coordinate. A point p in P is said to be a proximate point if there exists a point q on the x-axis such that p is the closest point to q over all points in P. The proximate point problem is to determine all the proximate points in P. Our main contribution is to propose optimal parallel algorithms for solving instances of size n of the proximat...
متن کاملOptimal Parallel Algorithms for the 3D Euclidean Distance Transform on the CRCW and EREW PRAM Models
In this paper, we develop parallel algorithms for the three-dimensional Euclidean distance transform (3D EDT) on both the CRCW and EREW PRAM computation models. Based on the dimensionality reduction technique and the solution for proximate points problem, we achieve the optimality of the 3D EDT computation. For an N × N × N binary image array, our parallel algorithms for 3D EDT computation are ...
متن کاملA Tasks Allocation Algorithm for Optimum Utilization of Processor’s in Heterogeneous Distributing Computing Systems
In Distributed Processing System (DPS), partitioning of the application software into small tasks and the proper mapping of these tasks among processors are one of the important parameter which determine the efficient utilization of available Processor’s Capacity. The model discussed here performs static task mapping/ allocation of a set of ‘m’ tasks of a program to a set of ‘n’ processors (whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990